Uncertain Scenario Based MicroGrid Optimization via Hybrid Levy Particle Swarm Variable Neighborhood Search Optimization (HL_PS_VNSO)
نویسندگان
چکیده
منابع مشابه
Variable Neighborhood Particle Swarm Optimization Algorithm
In this paper, we introduce a hybrid metaheuristic, the Variable Neighborhood Particle Swarm Optimization (VNPSO) algorithm, consisting of a combination of the Variable Neighborhood Search (VNS) and Particle Swarm Optimization(PSO). The proposed VNPSO algorithm is used for solving the multi-objective Flexible Job-shop Scheduling Problems (FJSP). Flexible job-shop scheduling is very important in...
متن کاملA hybrid Particle Swarm Optimization - Variable Neighborhood Search algorithm for Constrained Shortest Path problems
In this paper, a well known NP-hard problem, the Constrained Shortest Path problem, is studied. As efficient metaheuristic approaches are required for its solution, a new hybridized version of Particle Swarm Optimization algorithm with Variable Neighborhood Search is proposed for solving this significant combinatorial optimization problem. Particle Swarm Optimization (PSO) is a population-based...
متن کاملLevy Velocity Threshold Particle Swarm Optimization
Velocity threshold plays an important role in the particle swarm optimization. In this paper, a novel stochastic velocity threshold automation strategy is proposed by incorporated with Lévy probability distribution. As is known, Lévy probability distribution has an infinite second moment and is likely to generate an offspring that is far away from its parent. Therefore, this method employs a la...
متن کاملDiversity enhanced particle swarm optimization with neighborhood search
a School of Information Engineering, Nanchang Institute of Technology, Nanchang 330099, PR China b School of Computer, China University of Geosciences, Wuhan 430072, PR China c Faculty of Engineering and Applied Science, University of Ontario Institute of Technology (UOIT), 2000 Simcoe Street North, Oshawa, ON, Canada L1H 7K4 d Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen ...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2999935